Hypercubes and compromise values for cooperative fuzzy games

90D12;03E72cooperative games

Egalitarianism in convex fuzzy games

cooperative games;algorithm

Convex fuzzy games and participation monotonic allocation schemes

90D12;03E72cooperative games

Matchings with externalities and attitudes

Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real-life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas fully expressive representations of externalities in matchings require exponential space, in this paper we propose a compact model of externalities, in which the influence of a match on each agent is computed additively. Under this framework, we analyze many-to-many matchings and one-to-one matchings where agents take different attitudes when reasoning about the actions of others. In particular, we study optimistic, neutral and pessimistic attitudes and provide both computational hardness results and polynomial-time algorithms for computing stable outcomes

Some Characterizations of Convex Interval Games

This paper focuses on two characterizations of convex interval games using the notions of superadditivity and exactness, respectively. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of subadditivity and exactness.Cooperative interval games, convex games, big boss games, superadditive games, marginal games, exact games

Sequencing Interval Situations and Related Games

In this paper we consider one-machine sequencing situations with interval data. We present different possible scenarioes and extend classical results on well known rules and on sequencing games to the interval setting

A Game of Attribute Decomposition for Software Architecture Design

Attribute-driven software architecture design aims to provide decision support by taking into account the quality attributes of softwares. A central question in this process is: What architecture design best fulfills the desirable software requirements? To answer this question, a system designer needs to make tradeoffs among several potentially conflicting quality attributes. Such decisions are normally ad-hoc and rely heavily on experiences. We propose a mathematical approach to tackle this problem. Game theory naturally provides the basic language: Players represent requirements, and strategies involve setting up coalitions among the players. In this way we propose a novel model, called decomposition game, for attribute-driven design. We present its solution concept based on the notion of cohesion and expansion-freedom and prove that a solution always exists. We then investigate the computational complexity of obtaining a solution. The game model and the algorithms may serve as a general framework for providing useful guidance for software architecture design. We present our results through running examples and a case study on a real-life software project.Comment: 23 pages, 5 figures, a shorter version to appear at 12th International Colloquium on Theoretical Aspects of Computing (ICTAC 2015

Convex Interval Games

Convex interval games are introduced and characterizations are given. Some economic situations leading to convex interval games are discussed. The Weber set and the Shapley value are defined for a suitable class of interval games and their relations with the interval core for convex interval games are established. The notion of population monotonic interval allocation scheme (pmias) in the interval setting is introduced and it is proved that each element of the Weber set of a convex interval game is extendable to such a pmias. A square operator is introduced which allows us to obtain interval solutions starting from the corresponding classical cooperative game theory solutions. It turns out that on the class of convex interval games the square Weber set coincides with the interval core

A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents

We consider the well-studied cake cutting problem in which the goal is to identify a fair allocation based on a minimal number of queries from the agents. The problem has attracted considerable attention within various branches of computer science, mathematics, and economics. Although, the elegant Selfridge-Conway envy-free protocol for three agents has been known since 1960, it has been a major open problem for the last fifty years to obtain a bounded envy-free protocol for more than three agents. We propose a discrete and bounded envy-free protocol for four agents

DNA bending facilitates the error-free DNA damage tolerance pathway and upholds genome integrity

Abstract DNA replication is sensitive to damage in the template. To bypass lesions and complete replication, cells activate recombination-mediated (error-free) and translesion synthesis-mediated (error-prone) DNA damage tolerance pathways. Crucial for error-free DNA damage tolerance is template switching, which depends on the formation and resolution of damage-bypass intermediates consisting of sister chromatid junctions. Here we show that a chromatin architectural pathway involving the high mobility group box protein Hmo1 channels replication-associated lesions into the error-free DNA damage tolerance pathway mediated by Rad5 and PCNA polyubiquitylation, while preventing mutagenic bypass and toxic recombination. In the process of template switching, Hmo1 also promotes sister chromatid junction formation predominantly during replication. Its C-terminal tail, implicated in chromatin bending, facilitates the formation of catenations/hemicatenations and mediates the roles of Hmo1 in DNA damage tolerance pathway choice and sister chromatid junction formation. Together, the results suggest that replication-associated topological changes involving the molecular DNA bender, Hmo1, set the stage for dedicated repair reactions that limit errors during replication and impact on genome stability